Preoperative Needle Insertion Path Planning for Minimizing Deflection in Multilayered Tissues
نویسندگان
چکیده
منابع مشابه
Path Planning for Minimizing Detection
For a flying military vehicle, avoiding detection can be a key objective. To achieve this, flying the least-probability-of-detection path from A to B through a field of detectors is a fundamental strategy. While most of the previous optimization models aim to minimize the cumulative radar exposure, this paper derives a model that can directly minimize the probability of being detected. Furtherm...
متن کاملSensorless planning for medical needle insertion procedures
− Medical procedures such as seed implants, biopsies, and treatment injections require inserting a needle tip to a specific target location inside the human body. This is difficult because (1) insertion causes soft tissues to displace and deform, and (2) it is often difficult or impossible to obtain imaging data during insertion. We are developing a sensorless planning system for needle inserti...
متن کاملSensorless Motion Planning for Medical Needle Insertion in Deformable Tissue
Minimally invasive medical procedures such as biopsies, anesthesia drug injections, and brachytherapy cancer treatments require inserting a needle to a specific target inside soft tissue. This is difficult because needle insertion displaces and deforms the surrounding soft tissue causing the target to move during the procedure. To facilitate physician training and pre-operative planning for the...
متن کاملSimulating Needle Insertion and Radioactive Seed Implantation in Soft Tissues
We are developing a simulation of needle insertion and radioactive seed implantation to facilitate surgeon training and planning for brachytherapy for treating prostate cancer. Inserting a needle into soft tissues causes the tissues to displace and deform: ignoring these effects during seed implantation leads to imprecise seed placements. Surgeons should learn to compensate for these effects so...
متن کاملPath Planning for Minimizing the Expected Cost till Success
Consider a general path planning problem of a robot on a graph with edge costs, and where each node has a Boolean value of success or failure (with respect to some task) with a given probability. The objective is to plan a path for the robot on the graph that minimizes the expected cost till success. In this paper, it is our goal to bring a foundational understanding to this problem. We start b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Robotics and Automation Letters
سال: 2018
ISSN: 2377-3766,2377-3774
DOI: 10.1109/lra.2018.2809540